#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=60;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      LL n;cin>>n;
      for(LL i=1;i<=n;i++) cin>>a[i];
      bool flag=1;
      for(LL i=1;i<=n;i++){
          if(a[i]!=i) flag=0;
      }
      if(flag){
         cout<<"0"<<"\n";
      }
      else{
          if(a[1]==n&&a[n]==1){
             cout<<"3"<<"\n";
          }
          else if(a[1]==1||a[n]==n){
             cout<<"1"<<"\n";
          }
          else{
             cout<<"2"<<"\n";
          }
      }
   }
   return 0;
}
